From the Farkas Lemma to the Hahn-Banach Theorem

نویسندگان

  • N. Dinh
  • Miguel A. Goberna
  • Marco A. López
  • T. H. Mo
چکیده

This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f(x) ≥ 0 which are consequences of a composite convex inequality (S ◦ g)(x) ≤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-convex function. In parallel, associated versions of a stable Farkas lemma, considering arbitrary linear perturbations of f , are also given. These new versions of the Farkas lemma, and their corresponding stable forms, are established under the weakest constraint qualification conditions (the so-called closedness conditions), and they are actually equivalent to each other, as well as equivalent to an extended version of the so-called Hahn–Banach–Lagrange theorem, and its stable version, correspondingly. It is shown that any of them implies analytic and algebraic versions of the Hahn–Banach theorem and the Mazur–Orlicz theorem for extended sublinear functions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A FUZZY VERSION OF HAHN-BANACH EXTENSION THEOREM

In this paper, a fuzzy version of the analytic form of Hahn-Banachextension theorem is given. As application, the Hahn-Banach theorem for$r$-fuzzy bounded linear functionals on $r$-fuzzy normedlinear spaces is obtained.

متن کامل

Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma

The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.

متن کامل

Banach Spaces

Paul Garrett [email protected] http://www.math.umn.edu/ g̃arrett/ [This document is http://www.math.umn.edu/ ̃garrett/m/fun/notes 2012-13/05 banach.pdf] 1. Basic definitions 2. Riesz’ Lemma 3. Counter-example: non-existence of norm-minimizing element 4. Normed spaces of continuous linear maps 5. Dual spaces of normed spaces 6. Banach-Steinhaus/uniform-boundedness theorem 7. Open mapping theore...

متن کامل

How Incomputable is the Separable Hahn-Banach Theorem?

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

متن کامل

How Much Incomputable Is the Separable Hahn - Banach Theorem

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2014